A parallel version of the preconditioned conjugate gradient method for boundary element equations
نویسندگان
چکیده
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.
منابع مشابه
Deflation accelerated parallel preconditioned Conjugate Gradient method in Finite Element problems
We describe the algorithm to implement a deflation acceleration in a preconditioned Conjugate Gradient method to solve the system of linear equations from a Finite Element discretization. We focus on a parallel implementation in this paper. Subsequently we describe the data-structure. This is followed by some numerical experiments. The experiments indicate that our method is scalable.
متن کاملParallel Finite Element Approximate Inverse Preconditioning on Symmetric Multiprocessor Systems
Parallel normalized preconditioned conjugate gradient type methods based on normalized approximate finite element inverse matrix techniques are investigated for the efficient solution of sparse linear systems. Application of the proposed methods on a three dimensional boundary value problems is discussed and numerical results are given. The parallel implementation of the normalized precondition...
متن کاملAn K - Step Preconditioned Conjugate Gradient Hethod
Tbis paper describes a preconditioned conjugate gradient method tbat can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systema of linear equations. The implementation on the CYBER 203/205 and on tbe Finite Element Machine is discuased and result a obtained using the method on these machines are siven.
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملDomain Decomposition vs
Domain Decomposition (DD) techniques are not only the basic tools for data partitioning but also methods for constructing new parallel pde solvers. Domain Decomposition, mesh adaption and load balance seem to be in contradiction to the eecient use of massively parallel computers with serveral hundered, or even several thousand powerful, distributed memory processors. In the case of plane bounda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 2 شماره
صفحات -
تاریخ انتشار 1995